منابع مشابه
Process Algebraic Non-product-forms
A generalization of the Reversed Compound Agent Theorem of Markovian process algebra is derived that yields separable, but non-product-form solutions for collections of interacting processes such as arise in multi-class queueing networks with Processor Sharing servers. It is based on an analysis of the minimal cycles in the state space of a multi-agent cooperation, which can be simply identifie...
متن کاملReversed processes , product forms and a non - product form ∗
The equilibrium joint state probabilities of interacting Markov processes are obtained in a hierarchical way, by finding the reversed process of the interaction in terms of the reversed processes of its components. From a reversed process, a product-form solution for the joint state probabilities follows directly. The method uses a Markovian process algebra formalism and generalizes the recent ...
متن کاملReversed processses , product forms , non - product forms and a new proof of the BCMP theorem ∗
The equilibrium joint state probabilities of interacting Markov processes are obtained in a hierarchical way, by finding the reversed process of the interaction in terms of the reversed processes of the components. From a reversed process, a product-form solution for the joint state probabilities follows directly. The method uses a Markovian process algebra formalism and generalizes the recent ...
متن کاملOverconvergent Algebraic Automorphic Forms
I present a general theory of overconvergent p-adic automorphic forms and eigenvarieties for connected reductive algebraic groups G whose real points are compact modulo centre, extending earlier constructions for forms of GLn due to Buzzard, Chenevier and Yamagami. This leads to some new phenomena, including the appearance of intermediate spaces of “semiclassical” automorphic forms; this gives ...
متن کاملAsymptotic Forms and Algebraic Diierential Equations Asymptotic Forms and Algebraic Diierential Equations Asymptotic Forms and Algebraic Diierential Equations
We analyse the complexity of a simple algorithm for computing asymptotic solutions of an algebraic diierential equation. This analysis is based on a computation of the number of possible asymptotic monomials of a certain order, and on the study of the growth of this number as the order of the equation grows. Comportements asymptotiques et equations dii erentielles alg ebriques R esum e Nous ana...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2006
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2006.03.012